Tree limits and limits of random trees

نویسندگان

چکیده

Abstract We explore the tree limits recently defined by Elek and Tardos. In particular, we find for many classes of random trees. give general theorems three conditional Galton–Watson trees simply generated trees, split generalized (as here), a continuous-time branching process. These results include, example, labelled ordered recursive preferential attachment binary search

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local limits of random trees and maps

These pages form the lecture notes of a mini-course given at the IXth Young European Probabilists conference that took place in Eindhoven (March 2012). They contain some material extracted from [2, 8, 9]. We survey some aspects of local limits of random trees and maps and deal in particular with the so-called geometric Galton-Watson tree conditioned to survive and the uniform infinite planar qu...

متن کامل

Scaling limits of large random trees

The goal of these lectures is to survey some of the recent progress on the description of largescale structure of random trees. We will use the framework of Markov branching sequences of trees and develop several applications, to combinatorial trees, Galton-Watson trees, some dynamical models of randomly growing trees, cut trees, etc. This is a rough draft – to be completed – all comments are w...

متن کامل

A note on the scaling limits of random Pólya trees

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random Pólya trees: a uniform random Pólya tree of size n consists of a conditioned critical Galton-Watson tree Tn and many small forests, where with probability tending to one as n tends to infinity, each forest Fn(v) is maximally of size |Fn(v)| = O(log n). Their proo...

متن کامل

Limits in modified categories of interest

‎We firstly prove the completeness of the category of crossed modules in a modified category of interest‎. ‎Afterwards‎, ‎we define pullback crossed modules and pullback cat objects that are both obtained by pullback diagrams with extra structures on certain arrows‎. ‎These constructions unify many corresponding results for the cases of groups‎, ‎commutative algebras and can also be adapted to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorics, Probability & Computing

سال: 2021

ISSN: ['0963-5483', '1469-2163']

DOI: https://doi.org/10.1017/s0963548321000055